Run-time type computations in the Warren Abstract machine
نویسندگان
چکیده
منابع مشابه
Run-Time Type Computations in the Warren Abstract Machine
The type concept of the logic programming language PROTOS-L supports sorts, subsort relationships and parametric polymorphism. Due to the order-sortedness types are also present at run time, replacing parts of the deduction process required in an unsorted version by efficient type computations. Together with the polymorphism most of the flexibility of untyped logic programming carries over to t...
متن کاملVisualization as Debugging: Understanding/Debugging the Warren Abstract Machine
This paper presents a twofold proposal to understand the Warren Abstract Machine. A stepwise denition of the WAM by using abstract data types (for every WAM component) is brie BLOCKINy presented. Furthermore, we describe a visual environment which can be used for the emulation of the Warren Abstract Machine. It has been designed as a high level debugger for object oriented programs, following a...
متن کاملA Verified Prolog Compiler for the Warren Abstract Machine
We extend the theory of Prolog to provide a framework for the study of Prolog compilation technology. For this purpose, we rst demonstrate the semantic equivalence of two Prolog interpreters: a conventional SLD-refutation procedure and one that employs Warren's \last call" optimization. Next, we formally deene the Warren Abstract Machine (WAM) and its instruction set and present a Prolog compil...
متن کاملAutomatic Result Veriication by Complete Run-time Checking of Computations
Two-Stage Programming (2sp) is an experimental programming language, the rst implementation of the Speciication-Consistent Coordination Model (SCCM). The SCCM proposes a new, mixed-paradigm (functional/imperative) approach to developing reliable programs based on complete run-time checking of computations with respect to a given speciication. A 2sp program consists of a functional speciication ...
متن کاملAutomatic Result Verification by Complete Run-Time Checking of Computations
Received (received date) Revised (revised date) Communicated by Editor's name ABSTRACT Two-Stage Programming (2sp) is an experimental programming language, the rst implementation of the Speciication-Consistent Coordination Model (SCCM). The SCCM proposes a new, mixed-paradigm (functional/imperative) approach to developing reliable programs based on complete run-time checking of computations wit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic Programming
سال: 1994
ISSN: 0743-1066
DOI: 10.1016/0743-1066(94)90049-3